A new lower bound for LS-category

نویسندگان

چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

A Cohomological Lower Bound for the Transverse Ls Category of a Foliated Manifold

Let F be a compact Hausdorff foliation on a compact manifold. Let E 2 = ⊕{E 2 : p > 0, q ≥ 0} be the subalgebra of cohomology classes with positive transverse degree in the E2 term of the spectral sequence of the foliation. We prove that the saturated transverse Lusternik-Schnirelmann category of F is bounded below by the length of the cup product in E 2 . Other cohomological bounds are discussed.

متن کامل

A New Lower Bound for Completion Time Distribution Function of Stochastic PERT Networks

In this paper, a new method for developing a lower bound on exact completion time distribution function of stochastic PERT networks is provided that is based on simplifying the structure of this type of network. The designed mechanism simplifies network structure by arc duplication so that network distribution function can be calculated only with convolution and multiplication. The selection of...

متن کامل

A New Lower Bound for Flexible Flow Shop Problem with Unrelated Parallel Machines

Flexible flow shop scheduling problem (FFS) with unrelated parallel machines contains sequencing in flow shop where, at any stage, there exists one or more processors. The objective consists of minimizing the maximum completion time. Because of NP-completeness of FFS problem, it is necessary to use heuristics method to address problems of moderate to large scale problem. Therefore, for assessme...

متن کامل

A New Lower Bound for Completion Time Distribution Function of Stochastic PERT Networks

In this paper, a new method for developing a lower bound on exact completion time distribution function of stochastic PERT networks is provided that is based on simplifying the structure of this type of network. The designed mechanism simplifies network structure by arc duplication so that network distribution function can be calculated only with convolution and multiplication. The selection of...

متن کامل

A New Lower Bound for A(17,6,6)

We construct a record-breaking binary code of length 17, minimal distance 6, constant weight 6, and containing 113 codewords.

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Arabian Journal of Mathematics

سال: 2017

ISSN: 2193-5343,2193-5351

DOI: 10.1007/s40065-017-0181-5